A distributed algorithm for delay-constrained unicast routing
نویسندگان
چکیده
منابع مشابه
An Efficient Distributed Routing Algorithm for Delay Constrained Multicast
For dynamic QoS multicast routing, efficient handling of node’s join and leave is an important problem. This paper addresses the problem of optimally connecting a new node to an existing multicast tree under sourceto-destination delay and inter-destination delay variation constraints (MRDC-JOIN). We assume a QoS framework where a delay dependent cost function is associated with each network lin...
متن کاملA Distributed Delay-Constrained Dynamic Multicast Routing Algorithm
Many new distributed multimedia applications involve dynamic multiple participants, have stringent end-to-end delay requirement and consume large amount of network resources. In this paper, we propose a distributed delay-constrained dynamic multicast routing algorithm (DCDMR) to support these applications. DCDMR scales well because the source of the multicast tree needs only limited computation...
متن کاملA selection function based distributed algorithm for delay-constraint least-cost unicast routing
each network node and is always able to find a loop-free path satisfying the delay bound if such paths exist. Simulation study shows that the SF-DCLC is not as sensitive to the delay bound and network size as some other DCLC routing algorithms, and attains very low cost-inefficiency (less than 3% to the optimal one) in various network scenarios we simulate. The most attractive feature of SF-DCL...
متن کاملDistributed delay constrained multicast routing algorithm with efficient fault recovery
Existing distributed delay constrained multicast routing algorithms construct a multicast tree in a sequential fashion and need to be restarted when failures occur during the multicast tree construction phase or during an on-going multicast session. This article proposes an efficient distributed delay constrained multicast routing algorithm that constructs a multicast tree in a concurrent fashi...
متن کاملA new distributed routing algorithm for supporting delay-sensitive applications
We propose a new distributed delay-constrained unicast routing algorithm which can always nd a delay-constrained path with small message complexity if such a path exists. At each network node, limited information about the network state is needed and only a small amount of computation is required. Simulation results show that the proposed algorithm has much better cost performance than the leas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2000
ISSN: 1063-6692
DOI: 10.1109/90.842145